NON CONTACT VOLTAGE DETECTOR TESTER
نویسندگان
چکیده
In this project, a non contact voltage detector tester work by sensing very small amount of current that is capacitively coupled from the live circuit to and back ground. The system includes thyristors, antenna, LED, buzzar, resistor.
منابع مشابه
Non - contact surface charge / voltage measurements
Methods of measurements of surface electric charges and potentials using electrostatic fieldmeters and voltmeters are discussed. The differences and similarities between those methods are presented. The AC-feedback voltmeter is also described as an unique method that combines advantages of both fieldmeters and voltmeters.
متن کاملNon-contact breath sensor based on a Doppler detector
Respiratory activity is an important parameter for observation of human body activity. A normal adult has a respiratory rate of 12–15 breaths/min in normal conditions. Breath sensor based on non-contact Doppler detector allows for the measurement and detection and the absence of the breathing action, which may cause death in a few minutes. The monitoring and detection of some respiratory abnorm...
متن کاملConstant Voltage Contact Surface
LIDAR (laser radar) is used to measure three-dimensional(3-D) object positions. It produces a range and an intensity image ofthe measured object and relieson the range image to determine the 3-Dpositions of the object. But, the range image is frequently corrupted withnoise. A dynamic calibration method has been established to improvethe LIDAR accuracy basedon a polyn...
متن کاملA $\widetilde{O}(n)$ Non-Adaptive Tester for Unateness
Khot and Shinkar (RANDOM, 2016) recently describe an adaptive, O(n log(n)/ε)-query tester for unateness of Boolean functions f : {0, 1}n 7→ {0, 1}. In this note, we describe a simple non-adaptive, O(n log(n/ε)/ε) -query tester for unateness for real-valued functions over the hypercube.
متن کاملA Satisfiability Tester for Non-Clausal Propositional Calculus
An algorithm for satisfiability testing in the propositional calculus with a worst case running time that grows at a rate less than 2 (.25+ε) L is described, where L can be either the length of the input expression or the number of occurrences of literals (i.e., leaves) in it. This represents a new upper bound on the complexity of non-clausal satisfiability testing. The performance is achieved ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Scientific Journal Of Research In Engineering And Management
سال: 2023
ISSN: ['2582-3930']
DOI: https://doi.org/10.55041/ijsrem19020